On an inverse eigenproblem for Jacobi matrices
نویسندگان
چکیده
Recently Xu 13] proposed a new algorithm for computing a Jacobi matrix of order 2n with a given n n leading principal submatrix and with 2n prescribed eigenvalues that satisfy certain conditions. We compare this algorithm to a scheme proposed by Boley and Golub 2], and discuss a generalization that allows the conditions on the prescribed eigenvalues to be relaxed.
منابع مشابه
An A Priori Bound for Automated Multilevel Substructuring
Abstract. The Automated Multi-Level Substructuring (AMLS) method has been developed to reduce the computational demands of frequency response analysis and has recently been proposed as an alternative to iterative projection methods like Lanczos or Jacobi–Davidson for computing a large number of eigenvalues for matrices of very large dimension. Based on Schur complements and modal approximations...
متن کاملAn Inverse Eigenvalue Problem and an Associated Approximation Problem for Generalized K-centrohermitian Matrices
A partially described inverse eigenvalue problem and an associated optimal approximation problem for generalized K-centrohermitian matrices are considered. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula o...
متن کاملInverse Eigenvalue Problems and Their Associated Approximation Problems for Matrices with J-(Skew) Centrosymmetry
The inverse problems play an important role in MEG reconstructions [3, 4, 5, 6, 7]. In this paper, a partially described inverse eigenvalue problem and an associated optimal approximation problem for J-centrosymmetric matrices are considered respectively. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solutio...
متن کاملEla Structure Preserving Algorithms for Perplectic
Structured real canonical forms for matrices in Rn×n that are symmetric or skewsymmetric about the anti-diagonal as well as the main diagonal are presented, and Jacobi algorithms for solving the complete eigenproblem for three of these four classes of matrices are developed. Based on the direct solution of 4 × 4 subproblems constructed via quaternions, the algorithms calculate structured orthog...
متن کاملOn the Eigenstructure of Hermitian Toeplitz Matrices with Prescribed Eigenpairs
Toeplitz matrices have found important applications in bioinformatics and computational biology [5, 6, 11, 12]. In this paper we concern the spectral properties of hermitian Toeplitz matrices. Based on the fact that every centrohermitian matrix can be reduced to a real matrix by a simple similarity transformation, we first consider the eigenstructure of hermitian Toeplitz matrices and then disc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 11 شماره
صفحات -
تاریخ انتشار 1999